A Coding-Theoretic Application of Baranyai's Theorem

نویسنده

  • Liang Feng Zhang
چکیده

Baranyai’s theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all u-subsets of an n-element set into ( n−1 u−1 ) sub-families such that each sub-family form a partition of the n-element set, where n is divisible by u. In this paper, we present a codingtheoretic application of Baranyai’s theorem (or equivalently, the corollary). More precisely, we propose the first purely combinatorial construction of locally decodable codes. Locally decodable codes are error-correcting codes that allow the recovery of any message bit by looking at only a few bits of the codeword. Such codes have attracted a lot of attention in recent years. We stress that our construction does not improve the parameters of known constructions. What makes it interesting is the underlying combinatorial techniques and their potential in future applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A cone theoretic Krein-Milman theorem in semitopological cones

In this paper, a Krein-Milman  type theorem in $T_0$ semitopological cone is proved,  in general. In fact, it is shown that in any locally convex $T_0$ semitopological cone, every convex compact saturated subset is the compact saturated convex hull of its extreme points, which improves the results of Larrecq.

متن کامل

The Code Theoretic Axiom

A logical physical ontology is code theory, wherein reality is neither deterministic nor random. In light of Conway and Kochen’s free will theorem [1] and strong free will theorem [2], we discuss the plausibility of a third axiomatic option geometric language; the code theoretic axiom. We suggest freewill choices at the syntactically free steps of a geometric language of spacetime form the code...

متن کامل

Random Linear Intersession Network Coding With Selective Canceling

The network coding capacity of a single multicast traffic is characterized by the min-cut/max-flow (mcMF) theorem, which can be achieved by random linear network coding (RLNC). Nonetheless, the graph-theoretic characterization for multiple unicast/multicast traffic remains an open problem. This paper proposes and studies a new class of intersession-network-coding schemes: RLNC with selective ca...

متن کامل

Generalization of Darbo's fixed point theorem and application

In this paper, an attempt is made to present an extension of Darbo's theorem, and its applicationto study the solvability of a functional integral equation of Volterra type.

متن کامل

Automatic Detection of the Common and Non-common Frequencies in Congruent Discrete Spectra. A Theoretical Approach

Both sampling a time-varying signal, and its spectral analysis are activities subjected to theoretically compelling, such as Shannon's theorem and the objectively limiting of the frequency’s resolution. Usually, the signals’ spectra are processed and interpreted by a scientist who, presumably, has sufficient prior information about the monitored signals to conclude on the significant frequencie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2014